Coding of concentric information

ABSTRACT

A method for coding in frequency, module and phase a digital representation, in the space field, of a ring-shaped element, including the steps of: applying to any point of the element a polar conversion at constant angle, whereby the element is unfolded in rectangular form; transferring, to the frequency field, any point of the converted rectangular shape by means of a Fourier transform; filtering the discrete data resulting from the transfer by means of at least one real, bidimensional, band-pass filter, oriented along the phase axis; applying a Hilbert transform to the filtering results; applying an inverse Fourier transform to the results of the Hilbert transform; and extracting phase and module information in the space field.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to a method for coding a ring-shaped element of a digital image. More specifically, the present invention relates to a method for coding such an element in which the “useful” information is ring-shaped or circular, that is, where the information to be coded varies according to the angular position in concentric circles.

[0003] 2. Discussion of the Related Art

[0004] An example of application of the present invention is the coding of the iris of an eye in a digital image in a recognition process. On the one hand, the iris of an eye is a ring-shaped element delimited by the cornea and by the pupil. On the other hand, an iris is characterized by its texture, which is a set of three-dimensional patterns of bumps and holes, each pattern having in the iris a radial direction. Such a texture translates, upon digital two-dimensional acquisition, as the alternation of light and dark areas. The texture variation in the iris from the pupil edge to the cornea along a radial direction is very small. The information characteristic of the iris texture varies according to the angular position on concentric circles.

[0005] To enable relatively fast iris recognition, rather than comparing point by point a processed image with reference images, various methods for extracting its texture have been provided.

[0006] A first known method consists, as discussed in U.S. Pat No. 5,572,596 and in international patent application 00/62239, both of which are incorporated herein by reference, of decomposing the texture of the digital image into wavelets. In practice, this decomposition in wavelets or sub-strips is implemented by means of filtering cells applied on the space coordinates of the image and chosen to isolate low frequencies from high frequencies. After each filtering, a decimation (or sub-sampling by two) is performed, thus limiting the calculation complexity without loosing information. However, this type of sub-strip coding imposes use of a large memory storage to keep the significant information of the texture of the digital image.

[0007]FIG. 1 schematically illustrates, in the form of a block diagram, another known method for coding an iris, which consists of performing a local spectral decomposition by a set of band-pass filters, generally Gabor filters.

[0008] A digital image of an eye IMAGE, in which the iris to be coded has previously been localized, is considered. First, at block 101 (CONVERSION), the general ring-shape of the iris is transformed in straight rectangular form. This is done by converting the Cartesian coordinates of the iris into polar coordinates, by means of a constant angle polar conversion.

[0009]FIG. 2A schematically illustrates an iridian ring 201, delimited by a pupillary circle P and by the circular limit I between the iris and the cornea. An intermediary circle C between limits I and P is considered. Circle C includes the information to be coded.

[0010] By conversion 101, iridian ring 201 is transformed into a rectangular image 202 illustrated in FIG. 2B, in which the data of circle C are now distributed on a line, for example, horizontal.

[0011] At the next step, at block 102 (GABOR), a number of lines of the image and a number of points in these lines is selected and a filtering is applied to the retained discrete values, generally the pixel intensity (levels of grey), by means of a Gabor filter (band-pass). The choice of the central frequencies of the strips and of the bandwidths is performed according to a compromise between the constraints of precision and significance of the information extracted from the filtering. Generally, to obtain reliable results, the points of each of the selected lines are filtered over three frequency fields. “Frequency” here means a relative frequency expressed in cycles per image, that is, which refers to the dimensions of the initial image. The extracted information thus does not depend on the digitizing conditions, which enables subsequent direct comparison between a processed image and a reference image.

[0012] The used Gabor filter is a complex filter. For each of the central frequencies of the filer, analog information as to the real and imaginary parts Re and Im of the filtering products is thus obtained after filtering. The D.C. component being eliminated by the filtering, the obtained information varies around the used reference. FIGS. 2C and 2D respectively illustrate an example of variation of real part Re and of imaginary part Im along time t on a portion of a line of the image.

[0013] At the next step 103 (BINAR), illustrated in FIGS. 2E and 2F, the preceding data Re and Im are transformed into binary data.

[0014] Then, at block 104 (CODING), the binary data are coded, taking the phase into account (the information being in the angular direction). The phase coding is possible due to the fact that the Gabor filter is a complex filter and that the real and imaginary portions of the filter are in quadrature. Indeed, this enables considering that the ratio of the real and imaginary parts Re and Im is equal to the tangent of the phase.

[0015] The codes thus obtained for each of the processed lines or points are then used for any appropriate processing, for example, a comparison with reference codes to enable an iris recognition. An example of a known method for coding the local phase is described in U.S. Pat. No. 5,291,560, which is incorporated herein by reference.

[0016] A disadvantage of a Gabor filter method is the fact that it requires many calculations during the filtering, due to the very nature of the used filters. Indeed, the size of the convolution cores with respect to the size of the image to be convoluted (even after the gaussian envelope characteristic of Gabor filters has been truncated) and the complex structure including a real part and an imaginary part, of the filters lengthen the calculation times.

[0017] Another disadvantage is that the accuracy of the obtained coding is directly linked to the number of calculations. Accordingly, if more information is desired to discriminate two images, the amount and time of calculation must be increased.

SUMMARY OF THE INVENTION

[0018] The present invention aims at providing a method for coding information with a circular distribution in a ring-shaped element, which is faster than known methods.

[0019] The present invention also aims at providing such a method which provides a coding containing more information and thus more reliable results than known methods, without increasing the amount of calculation.

[0020] The present invention also aims at providing such a method applicable to the coding of the iris of an eye in a digitized image.

[0021] The present invention further aims at providing a filter which enables coding information with a circular distribution in a ring-shaped element, which is simpler than currently-used filters. In particular, the present invention aims at providing such a filter which enables simply and rapidly obtaining a code in phase, frequency, and module.

[0022] To achieve these and other objects, the present invention provides a method for coding in frequency, module, and phase a digital representation, in the space field, of a ring-shaped element, including the steps of:

[0023] applying to any point of the element a polar conversion at constant angle, whereby the element is unfolded in rectangular form;

[0024] transferring, to the frequency field, any point of the converted rectangular shape by means of a Fourier transform;

[0025] filtering the discrete data resulting from the transfer by means of at least one real, bidimensional, band-pass filter, oriented along the phase axis;

[0026] applying a Hilbert transform to the filtering results;

[0027] applying an inverse Fourier transform to the results of the Hilbert transform; and

[0028] extracting phase and module information in the space field.

[0029] According to an embodiment of the present invention, the real, bidimensional, band-pass filter oriented along the phase axis is the product of two one-dimensional Hamming windows, the transfer function of each of these windows being zero everywhere, except in a restricted frequency field around a central frequency in which its analytic expression is the following: ${{Y_{i,k}\left( f_{k} \right)} = {\alpha_{i,k} + {\left( {1 - \alpha_{i,k}} \right)\cos \frac{\pi \left( {f_{k} - {f\quad q_{i,k}}} \right)}{{f0}_{i,k}}}}},{w\quad h\quad e\quad r\quad e}$

[0030] i represents the index of the filter in a series (for example, three) of used filters;

[0031] k designates the direction of the considered Hamming window (k=1 or 2);

[0032] f_(k) is the current frequency;

[0033] α_(i,k) is a non-zero real positive number strictly smaller than 1, called the shape coefficient;

[0034] fq_(i,k) is the central frequency of the one-dimensional band-pass filter in direction k and of index i in the filter series; and

[0035] f0 _(i,k) determines the spectrum spreading centered on frequency fq_(i,k).

[0036] According to an embodiment of the present invention, the Hamming windows have identical coefficients α_(i,k).

[0037] According to an embodiment of the present invention, the Hamming windows are Hanning windows for which the identical coefficients α_(i,k) are 0.54.

[0038] According to an embodiment of the present invention, the Hamming windows have different coefficients α_(i,k).

[0039] According to an embodiment of the present invention, the real bidimensional band-pass filter oriented along the phase axis has a pass-band at −3 dB with a width of one octave.

[0040] According to an embodiment of the present invention, the pass-band of each of the Hamming windows is defined by: ${f0}_{i,k} = {\frac{\pi}{3{{arcos}\left( \frac{\frac{1}{2} - \alpha_{i,k}}{1 - \alpha_{i,k}} \right)}}{fq}_{i,k}}$

[0041] where arcos designates the inverse cosine function.

[0042] According to an embodiment of the present invention, the method consists of applying three real bidimensional band-pass filters oriented along the axis of the characteristic information of the rectangular image, of different central frequencies.

[0043] The present invention also provides a method for coding, in a digital image, a texture of a ring-shaped element defined by the including of a first circle of relatively small radius in a second circle of relatively large radius, consisting of implementing the method of any of the preceding embodiments.

[0044] According to an embodiment of the present invention, the ring is the iris of an eye, the first circle being the pupil of said eye and the second circle being the limit between the iris and the eye cornea.

[0045] The foregoing objects, features and advantages of the present invention, will be discussed in detail in the following non-limiting description of specific embodiments in connection with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0046]FIG. 1 illustrates in a flowchart the step sequence of a known iris coding method;

[0047]FIGS. 2A to 2F illustrate the implementation of some steps of the method of FIG. 1;

[0048]FIG. 3 illustrates in a flowchart the step sequence of an iris coding method according to an embodiment of the present invention; and

[0049]FIG. 4 illustrates the transfer function of a filter according to an embodiment of the present invention.

DETAILED DESCRIPTION

[0050] For clarity, the same elements have been designated with same references in the different drawings. Further, FIGS. 2A to 2F are not drawn to scale.

[0051] A coding mode of an iris or any other ring-shaped element including a texture, that is, characteristic information varying more significantly on concentric circles than along radial directions, is described hereafter in relation with FIGS. 3 and 4.

[0052] A digital image IMAGE to be processed includes a ring-shaped element to be coded, here, an iris, similar to that previously described in relation with FIG. 2A.

[0053] First, at block 301 (CONVERSION), the general ring shape of the iris is transformed into a rectangular shape 202 of FIG. 2B. This is done by converting the cartesian coordinates of the iris into polar coordinates, by means of a polar conversion at constant angle.

[0054] At the next step, at block 302 (FT), converted image 202 of FIG. 2B is transferred from the space field to the frequency field by a Fourier transform. A fast Fourier transform is generally used.

[0055] Then, at block 303 (FILTERING), the discrete values obtained by the Fourier transform are filtered by means of a real two-dimensional filter oriented in the direction of the characteristic information of the textured rectangular image.

[0056] According to a preferred embodiment of the present invention, a filter having its transfer function X_(i)(f₁,f₂) resulting from the product of two Hamming windows Y_(i,1)(f₁) and Y_(i,2)(f₂) (X_(i)(f₁,f₂)=Y_(i,1)(f₁). Y_(i,2)(f₂)), where f₁ and f₂ designate the frequencies in both directions of the bidimensional filter. The transfer function Y_(i,k)(f_(k)) of a Hamming window, illustrated in FIG. 5, is zero everywhere, except in a restricted frequency field around a central frequency in which its analytic expression is the following: ${{Y_{i,k}\left( f_{k} \right)} = {\alpha_{i,k} + {\left( {1 - \alpha_{i,k}} \right)\cos \frac{\pi \left( {f_{k} - {f\quad q_{i,k}}} \right)}{{f0}_{i,k}}}}},$

[0057] where

[0058] i represents the filter index among a series (for example, three) of used filters;

[0059] k designates the direction of the considered Hamming window (k=1 or 2);

[0060] f_(k) is the current frequency, ranging between f_(qi,k)−f0 _(i,k) and fq_(i,k)+f0 _(i,k);

[0061] α_(i,k) is a real non-zero positive number strictly smaller than 1, called the shape coefficient;

[0062] fq_(i,k) is the central frequency of the one-dimensional band-pass filter in direction k and of index i in the filter series; and

[0063] f0 _(i,k) determines the spectral spreading centered on frequency fq_(i,k).

[0064] According to an embodiment, the two Hamming windows Y_(i,1) and Y_(i,2) of the bidimensional filter have identical shape coefficients α_(i,1) and α_(i,2). Preferably, the Hamming windows then are Hanning windows for which shape coefficient α_(i,k) is 0.54.

[0065] As an alternative, the two Hamming windows Y_(i,1) and Y_(i,2) of the bidimensional filters have shape coefficients α_(i,1) and α_(i,2) different from each other.

[0066] According to a specific embodiment of the present invention, in the case of identical shape coefficients α_(k), the filter has a pass-band at −3 dB having a width of one octave along both image directions (vertical and horizontal).

[0067] Then, in the preferred embodiment using the product of two Hanning windows, with the preceding notations, the pass-band at −3 dB of the filter of one octave is obtained if value f0 _(i,k) with respect to central frequency fq_(i,k) is the following: ${{f0}_{i,k} = {\frac{\pi}{3{{arcos}\left( \frac{\frac{1}{2} - \alpha_{i,k}}{1 - \alpha_{i,k}} \right)}}{fq}_{i,k}}},$

[0068] where arcos designates the inverse cosine function.

[0069] The bidirectional band-pass filter having a bandwidth of one octave at −3 dB thus obtained is preferably applied for several different central frequencies fq_(i,k).

[0070] By choosing three central frequencies distributed to be separated by one octave (for example, 7, 14, and 28 cycles per image), the entire spectral field containing the information is covered. The three filters are separately applied to the rectangular iris image. Three result images are obtained.

[0071] At the next step, at block 304 (HILBERT), a Hilbert transform is applied to the results of the preceding filterings. A complete extension or discrete analytic image is then obtained, in accordance with the teachings of article “The analytic Image” by J. P Havlicek et al., IEEE 1997, pages 446-449, and as detailed in work “Handbook of image and video processing” by A. Bovic, published in 2000, which is incorporated herein by reference.

[0072] Then, an inverse Fourier transform of the analytic image is applied at block 305 (FT⁻¹) to return to the space field.

[0073] For each pass-band of the frequency field, that is, around each central frequency fq_(i,k), the module, instantaneous phase and emergent frequency information, respectively a_(i)(x₀,y₀), φ_(i)(x₀,y₀), and Δφ_(i)(x₀,y₀) are then extracted, at block 306 (DEMODULATION), in the space field, by means of standard demodulation methods. Such methods are described for example in “Discrete quasi eigenfunction approximation for AM-FM image analysis” by J. P Havlicek et al., IEEE 1996, pages 633-636 or in “The multi-component AM-FM image representation” by J. P Havlicek et al., IEEE transactions on image processing, June 1996, pages 1094-1096, both of which are incorporated herein by reference.

[0074] Although the method according to the present invention seems to be longer and more difficult to implement than known methods, it is quite the opposite. Indeed, the calculation sequences involved by the method advantageously use simpler operations than known methods and require less calculation time.

[0075] In particular, an advantage of the method according to the present invention is that the filtering to isolate the spectral components by means of a bidimensional filter, which is real in the frequency field (zero phase) and oriented in the direction of the concentric information requires less calculation than a Gabor filter or than a decomposition in wavelets.

[0076] Another advantage of the present invention is that since the used filter is real, it is non phase-shifting. It is thus not necessary to apply two filters in quadrature and a coder. The extraction of the phase and module data is then performed by demodulation, as described previously, directly in an analytic image obtained by a Hilbert transformation. Such a transformation-demodulation sequence is simpler and faster to implement.

[0077] A specific advantage of the preferred embodiment of the present invention using Hamming windows is that the used filter has a transfer function in which the most complicated involved mathematical function is a cosine. This filter is thus particularly simpler than a Gabor filter which includes more complicated functions, especially complex exponential functions corresponding to the sum of cosine and sine functions.

[0078] Another advantage of a method according to the present invention is the fact that a same number of calculations can provide (upon demodulation) different amounts of information allowing an increased reliability according to the application and the discrimination needs. In other words, the number of discriminating data between two images is independent from the number of calculations performed until demodulation. As compared to the known method using Gabor band-pass filters, this improvement is due to the fact that, according to the present invention, the entire image is processed instead of a reduced number of lines and points. This processing of the entire image is possible without increasing processing times since the implemented processings are more efficient.

[0079] Generally, the method according to the present invention applies to the coding of a texture of a ring-shaped element, the texture being characterized by information to be coded which essentially varies according to the angular position in concentric circles.

[0080] Such a coding may be used to detect the presence of such a texture. For example, in the woodworking industry, it enables detecting the presence of defects of knot type in the wood in quality control tests. Indeed, if the product, for example, a board, contains no defect, the texture information will be homogeneous. However, in the presence of a defect, a strong variation will be observed in the information.

[0081] In the previously-described iris coding application, the obtained code in module, phase, and frequency enables an iridian recognition usable as a recognition parameter to identify an individual. An example of application is the access control: access to a physical site, such as the controlling of the opening of a door with a code, or with an access card; access to a bank account usually protected by a password; access to any device such as a computer or a portable phone usually protected by a code to be typed. Such a device may also replace the fingerprint identification or another biometric identification.

[0082] Of course, the present invention is likely to have various alterations, modifications, and improvement which will readily occur to those skilled in the art. In particular, it has been considered in FIG. 3 that the method starts with the acquisition of an eye image. However, the image may come from a database. Further, it has been considered in the foregoing description that the ring-shaped element to be coded had circular internal and external limits. Generally, the limits may be elliptic, provided that the characterizing information remain variable according to the angular direction.

[0083] Such alterations, modifications, and improvements are intended to be part of this disclosure, and are intended to be within the spirit and the scope of the present invention. Accordingly, the foregoing description is by way of example only and is not intended to be limiting. The present invention is limited only as defined in the following claims and the equivalents thereto. 

What is claimed is:
 1. A method for coding in frequency, module and phase a digital representation, in the space field, of a ring-shaped element, including the steps of: applying to any point of the element a polar conversion at constant angle, whereby the element is unfolded in rectangular form; transferring, to the frequency field, any point of the converted rectangular shape by means of a Fourier transform; filtering the discrete data resulting from the transfer by means of at least one real, bidimensional, band-pass filter, oriented along the phase axis; applying a Hilbert transform to the filtering results; applying an inverse Fourier transform to the results of the Hilbert transform; and extracting phase and module information in the space field.
 2. The method of claim 1, wherein the real, bidimensional, band-pass filter oriented along the phase axis is the product of two one-dimensional Hamming windows, the transfer function of each of these windows being zero everywhere, except in a restricted frequency field around a central frequency in which its analytic expression is the following: ${{Y_{i,k}\left( f_{k} \right)} = {\alpha_{i,k} + {\left( {1 - \alpha_{i,k}} \right)\cos \frac{\pi \left( {f_{k} - {f\quad q_{i,k}}} \right)}{{f0}_{i,k}}}}},$

where i represents the index of the filter in a series of used filters; k designates the direction of the considered Hamming window; f_(k) is the current frequency; α_(i,k) is a non-zero real positive number strictly smaller than 1; fq_(i,k) is the central frequency of the one-dimensional band-pass filter in direction k and of index i in the filter series; and f0 ^(i,k) determines the spectral spreading centered on frequency fq_(i,k).
 3. The method of claim 2, wherein the Hamming windows have identical coefficients α_(i,k).
 4. The method of claim 3, wherein the Hamming windows are Hanning windows for which the identical coefficients α_(i,k) are 0.54.
 5. The method of claim 2, wherein the Hamming windows have different coefficients α_(i,k).
 6. The method of claim 1, wherein the real bidimensional band-pass filter oriented along the phase axis has a pass-band at −3 dB with a width of one octave.
 7. The method of claim 4, wherein the pass-band of each of the Hamming windows is defined by: ${{f0}_{i,k} = {\frac{\pi}{3{{arcos}\left( \frac{\frac{1}{2} - \alpha_{i,k}}{1 - \alpha_{i,k}} \right)}}{fq}_{i,k}}},$

where arcos designates the inverse cosine function.
 8. The method of claim 1, comprising applying three real bidimensional band-pass filters oriented along the axis of the characteristic information of the rectangular image, of different central frequencies.
 9. A method for coding, in a digital image, a texture of a ring-shaped element defined by including a first circle of relatively small radius in a second circle of relatively large radius, including implementing the method of claim
 1. 10. The method of claim 9, wherein the ring is the iris of an eye, the first circle being the pupil of said eye and the second circle being the limit between the iris and the eye cornea. 